Implementation of Bacterial Foraging Optimization Algorithm in Leaf Spring Cutting Stock Problem

نویسندگان

  • P. Murugan
  • R. Karthikeyan
  • K. Pandiaraj
چکیده

Although the latest enterprise resource planning software provides efficient scheduling of production processes, they have less impact on material marking process, since they focus on the utilization of materials and machines with respect to time. The classical optimization procedures are found to be inefficient in finding the optimal material usage, when the real world complex problems become exponential. Recent publications of many researchers prove the successful implementation of the bio inspired optimization algorithms in such domains. In this article, the chief mechanism of bacterial foraging optimization algorithm and their search parameters are exploited to provide optimal solutions for the cutting stock problem faced by the leaf spring assembly manufacturing industries. Minimization of the trim loss during the cutting of twelve leaves in batches is considered for optimization in order to maximize the material utilization. It is found that the optimal values evolved out of the BFOA are superior when compared with Tabu Search Method. The search characteristics of the E.coli bacteria under consideration is found to be excel in producing the optimal results closer to null values for trim loss. This work also highlights the easy implementation and adoptability of the developed optimization procedure to similar kind of domains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sub-transmission sub-station expansion planning based on bacterial foraging optimization algorithm

In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future load demand. The large number of design variables and combination of discr...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

Substation Expansion Planning Based on BFOA

In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future demand. The large number of design variables, and combination of discrete ...

متن کامل

A simple approach to the two-dimensional guillotine cutting stock problem

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015